Wait-free implementations in message-passing systems
نویسندگان
چکیده
منابع مشابه
Wait-Free Implementations in Message-Passing Systems
We study the round complexity of problems in a synchronous, message-passing system with crash failures. We show that if processors start in order-equivalent states, then a logarithmic number of rounds is both necessary and sufficient for them to reach order-inequivalent states. These upper and lower bounds are significant because they establish a complexity threshold below which no nontrivial p...
متن کاملWait Free Computation in Message Passing Systems Preliminary Report
We explore the time complexity of wait free implementations of concurrent objects in syn chronous message passing systems Our technique is to reduce the di cult problem of analyzing all possible wait free implementations for a particular object to the more tractable problem of analyz ing a related decision problem The decision prob lem we consider is strong renaming in which an arbi trary subse...
متن کاملGossiping in Message-Passing Systems
We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes than itself. This problem is at the heart of many distributed algorithms, and it is tightly related to questions from formal methods concerning the expressive power of distributed automata. We provide a non-determinis...
متن کاملAn Evaluation of Message Passing Implementations on Beowulf Workstations
Beowulf workstations have become a popular choice for high-end computing in a number of application domains. One of the key building blocks of parallel applications on Beowulf workstations is a message passing library. While there are message passing library implementations available for use on Beowulf workstations, as of yet none have been specifically tailored to this new, unique architecture...
متن کاملAn evaluation of Java implementations of message-passing
As an objected-oriented programming language and a platform-independent environment, Java has been attracting much attention. However, the trade-off between portability and performance has not spared Java. The initial performance of Java programs has been poor, due to the interpretive nature of the environment. In this paper we present the communication performance results of three different ty...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00242-4